Minimal Cost Flow in Processing Networks, a Primal Approach.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On ‎T‎he Fractional Minimal Cost Flow Problem of a Belief Degree Based Uncertain Network‎

A fractional minimal cost flow problem under linear type belief degree based uncertainty is studied for the first time. This type of uncertainty is useful when no historical information of an uncertain event is available. The problem is crisped using an uncertain chance-constrained programming approach and its non-linear objective function is linearized by a variable changing approach. An illus...

متن کامل

An Auction Based Approach to Multicommodity Minimal Cost Flow Problems

English In this paper, we introduce a new algorithm for solving Multicommodity Minimal Cost Flow problems; the Auction Algorithm (AA). This algorithm is special: It is not efficient on its own, but it uses the strength of the many. The Auction Algorithm can be run fully distributed. The main idea of the algorithm is that commodities bid on the arcs they want to use. A second algorithm determine...

متن کامل

A Minimal-Cost Inherent-Feedback Approach for Low-Power MRF-Based Logic Gates

The Markov random field (MRF) theory has been accepted as a highly effective framework for designing noise-tolerant nanometer digital VLSI circuits. In MRF-based design, proper feedback lines are used to control noise and keep the circuits in their valid states. However, this methodology has encountered two major problems that have limited the application of highly noise immune MRF-based circui...

متن کامل

A Primal-Dual Approach for a Total Variation Wasserstein Flow

We consider a nonlinear fourth-order diffusion equation that arises in denoising of image densities. We propose an implicit timestepping scheme that employs a primal-dual method for computing the subgradient of the total variation semi-norm. The constraint on the dual variable is relaxed by adding a penalty term, depending on a parameter that determines the weight of the penalisation. The paper...

متن کامل

The minimal work cost of information processing

Irreversible information processing cannot be carried out without some inevitable thermodynamical work cost. This fundamental restriction, known as Landauer's principle, is increasingly relevant today, as the energy dissipation of computing devices impedes the development of their performance. Here we determine the minimal work required to carry out any logical process, for instance a computati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of the Operational Research Society

سال: 1985

ISSN: 0160-5682

DOI: 10.2307/2582890